Logarithmic uniform distribution of $(\alpha n+\beta log n)$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Random Log-Depth Decision Trees under the Uniform Distribution

We consider three natural models of random log-depth decision trees. We give an efficient algorithm that for each of these models learns—as a decision tree—all but an inverse polynomial fraction of such trees using only uniformly distributed random examples.

متن کامل

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

The Logarithmic Constant : log 2

An introduction to the history of the constant log 2 and to its computation. It includes many formulas and some methods to estimate it, as well as the logarithm of any number, with few digits or to the greatest accuracy. ...by shortening the labors, doubled the life of the astronomer. Pierre Simon de Laplace (1749-1827) about logarithms. You have no idea, how much poetry there is in the calcula...

متن کامل

Record Range of Uniform Distribution

We consider a sequence of independent and identicaly distributed (iid) random variables with absolutely continuous distribution function F(x) and probability density function (pdf) f(x). Let Rnl be the largest observation after observing nth record and R(ns) be the smallest observation after observing the nth record. Then we say Wnr = Rnl− R(ns), n > 1, as the nth record range. We will c...

متن کامل

Ruspace(log N) Dspace(log 2 N= Log Log N) 1

We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tsukuba Journal of Mathematics

سال: 1986

ISSN: 0387-4982

DOI: 10.21099/tkbjm/1496160463